Chords in graphs
نویسندگان
چکیده
We characterize all simple graphs such that each edge is a chord of some cycle. As a consequence, we characterize all simple 2-connected graphs such that, for any two adjacent vertices x and y, the local connectivity k(x, y) ≥ 3. We also make a conjecture about chords for 3-connected graphs.
منابع مشابه
Excluding cycles with a fixed number of chords
Trotignon and Vušković completely characterized graphs that do not contain cycles with exactly one chord. In particular, they show that such a graph G has chromatic number at most max(3, ω(G)). We generalize this result to the class of graphs that do not contain cycles with exactly two chords and the class of graphs that do not contain cycles with exactly three chords. More precisely we prove t...
متن کاملThe Complexity of Colouring Circle Graphs
We study the complexity of the colouring problem for circle graphs. We will solve the two open questions of [Un88], where first results were presented. 1. Here we will present an algorithm which solves the 3-colouring problem of circle graphs in time O(n log(n)). In [Un88] we showed that the 4-colouring problem for circle graphs is NP-complete. 2. If the largest clique of a circle graph has siz...
متن کاملPairs of edges as chords and as cut-edges
Several authors have studied the graphs for which every edge is a chord of a cycle; among 2-connected graphs, one characterization is that the deletion of one vertex never creates a cut-edge. Two new results: among 3-connected graphs with minimum degree at least 4, every two adjacent edges are chords of a common cycle if and only if deleting two vertices never creates two adjacent cut-edges; am...
متن کاملThe Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. In this paper, it is proved that for a planar graph G with maximum degree ∆(G) ≥ 7, la(G) = d 2 e if G has no 5-cycles with chords.
متن کاملMinimum Weight Feedback Vertex Sets in Circle n-Gon Graphs and Circle Trapezoid Graphs
A circle n-gon is the region between n non-crossing chords of a circle; the sides of a circle n-gon are either chords or arcs of the circle. A circle n-gon graph is the intersection graph of a family of circle n-gons in a circle. The family of circle trapezoid graphs is exactly the family of circle 2-gon graphs and the family of circle graphs is exactly the family of circle 1-gon graphs. The fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 32 شماره
صفحات -
تاریخ انتشار 2005